On geometric optimization with few violated constraints
نویسندگان
چکیده
منابع مشابه
Optimization with few violated constraints for linear bounded error parameter estimation
In the context of linear constrained optimization, we study in this paper the problem of finding an optimal solution satisfying all but of the given constraints. A solution is obtained by means of an algorithm of the complexitymin ( ) ( ) , where is the dimension of the problem. We then use these results to solve the problem of robust identification in the presence of outliers in the setting of...
متن کاملOptimization of Caching Devices with Geometric Constraints
It has been recently advocated that in large communication systems it is beneficial both for the users and for the network as a whole to store content closer to users. One particular implementation of such an approach is to co-locate caches with wireless base stations. In this paper we study geographically distributed caching of a fixed collection of files. We model cache placement with the hel...
متن کاملStochastic geometric optimization with joint probabilistic constraints
This paper discusses geometric programs with joint probabilistic constraints. When the stochastic parameters are normally distributed and independent of each other, we approximate the problem by using piecewise polynomial functions with non-negative coefficients, and transform the approximation problem into a convex geometric program. We prove that this approximation method provides a lower bou...
متن کاملSupply chain network design with multi- mode demand based on acceptance degree of fuzzy constraints violated
This paper designs a mathematical model for supply chain network design problem including plants, distributors and customers in fuzzy environment. Each plant and distributor has several levels capacities. A multi-mode demand strategy is considered for the customers where only one of the modes is to be selected for each customer. Considering the acceptance degree of fuzzy constraints violated, a...
متن کاملOptimization over Integers with Robustness in Cost and Few Constraints
Robust optimization is an approach for optimization under uncertainty that has recently attracted attention both from theory and practitioners. While there is an elaborate and powerful machinery for continuous robust optimization problems, results on robust combinatorial optimization and robust linear integer programs are still rare and hardly general. In a seminal paper Bertsimas and Sim [7] s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1995
ISSN: 0179-5376,1432-0444
DOI: 10.1007/bf02570713